7,442 research outputs found

    Estimation of subgraph density in noisy networks

    Full text link
    While it is common practice in applied network analysis to report various standard network summary statistics, these numbers are rarely accompanied by uncertainty quantification. Yet any error inherent in the measurements underlying the construction of the network, or in the network construction procedure itself, necessarily must propagate to any summary statistics reported. Here we study the problem of estimating the density of an arbitrary subgraph, given a noisy version of some underlying network as data. Under a simple model of network error, we show that consistent estimation of such densities is impossible when the rates of error are unknown and only a single network is observed. Accordingly, we develop method-of-moment estimators of network subgraph densities and error rates for the case where a minimal number of network replicates are available. These estimators are shown to be asymptotically normal as the number of vertices increases to infinity. We also provide confidence intervals for quantifying the uncertainty in these estimates based on the asymptotic normality. To construct the confidence intervals, a new and non-standard bootstrap method is proposed to compute asymptotic variances, which is infeasible otherwise. We illustrate the proposed methods in the context of gene coexpression networks

    Papers prepared for the Colloquium "Working for Europe: Perspectives on the EU 50 Years after the Treaties of Rome"

    Get PDF
    The Chamber of Representatives of the Belgian Parliament asked the permanent professors of the College of Europe to write brief papers for a conference organized in honour of the 50th anniversary of the Treaty of Rome. The objective of these papers was to highlight the main challenges facing the European Union in four different issue areas (Lisbon Strategy, enlargement, Neighbourhood Policy and institutional reform) and to generate a debate among Belgian academics, politicians and members of civil society. The papers produced used to promote this discussion are reprinted here

    Coupling of Nonlocal Potentials to Electromagnetic Fields

    Full text link
    Nonlocal Hamiltonians are used widely in first-principles quantum calculations; the nonlocality stems from eliminating undesired degrees of freedom, e.g. core electrons. To date, attempts to couple nonlocal systems to external electromagnetic (EM) fields have been heuristic or limited to weak or long wavelength fields. Using Feynman path integrals, we derive an exact, closed-form coupling of arbitrary EM fields to nonlocal systems. Our results justify and clarify the couplings used to date and are essential for systematic computation of linear and especially nonlinear response.Comment: 1 figure, 1 tabl

    A Sierpinski Mandelbrot spiral for rational maps of the form Zᴺ + λ / Zᴰ

    Get PDF
    We identify three structures that lie in the parameter plane of the rational map F(z) = zⁿ + λ / zᵈ, for which z is a complex number, λ a complex parameter, n ≥ 4 is even, and d ≥ 3 is odd. There exists a Sierpindelbrot arc, an infinite sequence of pairs of Mandelbrot sets and Sierpinski holes, that limits to the parameter at the end of the arc. There exists as well a qualitatively different Sierpindelbrot arc, an infinite sequence of pairs of Mandelbrot sets and Sierpinski holes, that limits to the parameter at the center of the arc. Furthermore, there exist infinitely many arcs of each type. A parameter can travel along a continuous path from the Cantor set locus, along infinitely many arcs of the first type in a successively smaller region of the parameter plane, while passing through an arc of the second type, to the parameter at the center of the latter arc. This infinite sequence of Sierpindelbrot arcs is a Sierpinski Mandelbrot spiral
    corecore